Robust random search with scale-free stochastic resetting

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of stationary states in random walks with stochastic resetting.

It is known that introducing a stochastic resetting in a random-walk process can lead to the emergence of a stationary state. Here we study this point from a general perspective through the derivation and analysis of mesoscopic (continuous-time random walk) equations for both jump and velocity models with stochastic resetting. In the case of jump models it is shown that stationary states emerge...

متن کامل

Diffusion with stochastic resetting.

We study simple diffusion where a particle stochastically resets to its initial position at a constant rate r. A finite resetting rate leads to a nonequilibrium stationary state with non-Gaussian fluctuations for the particle position. We also show that the mean time to find a stationary target by a diffusive searcher is finite and has a minimum value at an optimal resetting rate r*. Resetting ...

متن کامل

Random Walks with Look-Ahead in Scale-Free Random Graphs

If m ≥ 2 is constant and 0 ≤ r ≤ ε log log n for a small positive constant ε, then whp a random walk with look-ahead r on a scale-free graph G = G(m,n) has cover time CG(r) ∼ (2/(mr−1(m − 1))) n log n.

متن کامل

Distributionally Robust Stochastic Programming with Binary Random Variables

In this paper, we consider stochastic programming with binary random variables, that is, when the random variable represents random subsets of a set. We consider a distributionally robust model, where the only knowledge about the distribution is the marginal probability of each element to appear in the random set. The objective is to minimize expected cost under the worst case distribution with...

متن کامل

Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms

Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The focus was on obtaining a finite approximation that captures the entire solution set in some suitable sense, which was defined by the concept of epsilon-dominance. Though bounds on the quality of the limit approximation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2019

ISSN: 2470-0045,2470-0053

DOI: 10.1103/physreve.100.032110